Improved formulations for minimum connectivity network interdiction problems
نویسندگان
چکیده
منابع مشابه
Bilevel Network Interdiction Models: Formulations and Solutions
This definition is unnecessarily restrictive— for instance, it should also include ship-based firepower—but the essence is reasonable: interdiction connotes preemptive attacks that limit an enemy’s subsequent ability to wage war, or carry out other nefarious activities. The mathematical study of interdiction has focused primarily on network interdiction, in which an enemy’s activities are model...
متن کاملStrong formulations for network design problems with connectivity requirements
The network design problem with connectivity requirements (NDC) models a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity NDC problem: unitary problems requiring connected network designs, and nonunitary problems permit...
متن کاملFormulations and algorithms for network design problems with connectivity requirements
Recent rapid technological advances (including high-capacity fiber-optic cables) in the telecommunications industry have introduced numerous opportunities for services other than traditional voice transmission. Disruptions in service for these high capacity systems can be (and have been) disastrous. For these reasons, network reliability is critical. This thesis studies the problem of topologic...
متن کاملMinimum Power Connectivity Problems
Given a (directed or undirected) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we consider some fundamental network design problems under the power minimization criteria. Let G = (V, E) be a graph with edge-costs {ce : e ∈ E} and let ...
متن کاملImproved Hardness for Cut, Interdiction, and Firefighter Problems
We study variants of the classic s-t cut problem and prove the following improved hardness results assuming the Unique Games Conjecture (UGC). • For any constant k ≥ 2 and ǫ > 0, we show that Directed Multicutwith k source-sink pairs is hard to approximate within a factor k − ǫ. This matches the trivial k-approximation algorithm. By a simple reduction, our result for k = 2 implies that Directed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2018
ISSN: 0305-0548
DOI: 10.1016/j.cor.2018.04.012